Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph

Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let [Formula: see text], [Formula: see text] and [Formula: see text] be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, respectively. In this paper, we give lower bounds on [Formula: see text], [Formula: see text], [For...

متن کامل

Ela on the Main Signless Laplacian Eigenvalues of a Graph

A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...

متن کامل

On the sum of signless Laplacian eigenvalues of a graph

For a simple graph G, let e(G) denote the number of edges and Sk(G) denote the sum of the k largest eigenvalues of the signless Laplacian matrix of G. We conjecture that for any graph G with n vertices, Sk(G) ≤ e(G) + k+1 2 for k = 1, . . . , n. We prove the conjecture for k = 2 for any graph, and for all k for regular graphs. The conjecture is an analogous to a conjecture by A.E. Brouwer with ...

متن کامل

A relation between the Laplacian and signless Laplacian eigenvalues of a graph

Let G be a graph of order n such that ∑n i=0(−1)iaiλn−i and ∑n i=0(−1)ibiλn−i are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that ai ≥ bi for i = 0,1, . . . , n. As a consequence, we prove that for any α, 0 < α ≤ 1, if q1, . . . , qn and μ1, . . . ,μn are the signless Laplacian and the Laplacian eigenvalues of G, respectively,...

متن کامل

Nordhaus-Gaddum Type Inequalities for Laplacian and Signless Laplacian Eigenvalues

Let G be a graph with n vertices. We denote the largest signless Laplacian eigenvalue of G by q1(G) and Laplacian eigenvalues of G by μ1(G) > · · · > μn−1(G) > μn(G) = 0. It is a conjecture on Laplacian spread of graphs that μ1(G)−μn−1(G) 6 n − 1 or equivalently μ1(G) + μ1(G) 6 2n − 1. We prove the conjecture for bipartite graphs. Also we show that for any bipartite graph G, μ1(G)μ1(G) 6 n(n − ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.12.015